On path-pairability in the Cartesian product of graphs
نویسندگان
چکیده
منابع مشابه
On Path-pairability in the Cartesian Product
9 We study the inheritance of path-pairability in the Cartesian product of 10 graphs and prove additive and multiplicative inheritance patterns of path11 pairability, depending on the number of vertices in the Cartesian product. 12 We present path-pairable graph families that improve the known upper 13 bound on the minimal maximum degree of a path-pairable graph. Further 14 results and open que...
متن کاملLinkedness and Path-Pairability in the Cartesian Product of Graphs
In this dissertation I summarize my work in the field of linkedness and pathpairability of graphs with primary focus on the inheritance of the mentioned properties in the Cartesian product of graphs. We obtain a general additive inheritance bound for linkedness. We determine the exact linkedness number of hypercubes, as well as affine and projective grids of arbitrary dimensions. Similar inheri...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملOn subgraphs of Cartesian product graphs
Graphs which can be represented as nontrivial subgraphs of Cartesian product graphs are characterized. As a corollary it is shown that any bipartite, K2,3-free graph of radius 2 has such a representation. An infinite family of graphs which have no such representation and contain no proper representable subgraph is also constructed. Only a finite number of such graphs have been previously known.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2016
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1888